Multi Constraint Shortest Path Routing
نویسندگان
چکیده
منابع مشابه
Overview of Constraint-Based Path Selection Algorithms for QoS Routing
Constraint-based path selection is an invaluable component of a full-ßedged quality of service (QoS) architecture. It aims at identifying a path that satisÞes a set of constraints (e.g., bounded delay, packet loss rate, etc.). Unfortunately, multi-constrained path selection problems are NPcomplete, and therefore often considered computationally intractable. This has led to the proposal of many ...
متن کاملCoerced Delay and Multi Additive Constraints QoS Routing Schemes
IP networks are evolving from data communication infrastructure into many real-time applications such as video conferencing, IP telephony and require stringent Quality of Service (QoS) requirements. A rudimentary issue in QoS routing is to find a path between a source-destination pair that satisfies two or more endto-end constraints and termed to be NP hard or complete. In this context, we pres...
متن کاملMulti-path constraint-based routing algorithms for MPLS traffic engineering
(CSPF) routing algorithm, there is a high probability that it can not find a feasible path through networks for a large bandwidth constraint which is one of the most important constraints for traffic engineering. The proposed algorithms can divide the bandwidth constraint into two or more sub-constraints and find a constrained path for each sub-constraint, if there is no single path satisfying ...
متن کاملA Review of Constraint-Based Routing Algorithms
Constraint-based routing is an invaluable part of a full-ßedged Quality of Service (QoS) architecture. Unfortunately, routing with multiple additive constraints is known to be a NP-complete problem. Hence, accurate constraint-based routing algorithms with a fast running time are scarce, perhaps even non-existent. The expected impact of such a constrained-based routing algorithm has resulted in ...
متن کاملM _ CSPF : A Scalable CSPF Routing Scheme with Multiple QoS Constraints for MPLS Traffic Engineering
Daniel W. Hong et al. 733 In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets ba...
متن کامل